A Visualization Method of Four Dimensional Polytopes by Oval Display of Parallel Hyperplane Slices

نویسنده

  • Akira Kageyama
چکیده

A method to visualize polytopes in a four dimensional euclidian space (x, y, z, w) is proposed. A polytope is sliced by multiple hyperplanes that are parallel each other and separated by uniform intervals. Since the hyperplanes are perpendicular to the w axis, the resulting multiple slices appear in the three-dimensional (x, y, z) space and they are shown by the standard computer graphics. The polytope is rotated extrinsically in the four dimensional space by means of a simple input method based on keyboard typings. The multiple slices are placed on a parabola curve in the three-dimensional world coordinates. The slices in a view window form an oval appearance. Both the simple and the double rotations in the four dimensional space are applied to the polytope. All slices synchronously change their shapes when a rotation is applied to the polytope. The compact display in the oval of many slices with the help of quick rotations facilitate a grasp of the four dimensional configuration of the polytope.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keyboard Based Control of Four Dimensional Rotations

Aiming at applications to the scientific visualization of three dimensional simulations with time evolution, a keyboard based control method to specify rotations in four dimensions is proposed. It is known that four dimensional rotations are generally so-called double rotations, and a double rotation is a combination of simultaneously applied two simple rotations. The proposed method can specif...

متن کامل

On Computing the Shadows and Slices of Polytopes

We study the projection of polytopes along k orthogonal vectors for various input and output forms. We show that if k is part of the input and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing ...

متن کامل

3D Visualization Models of the Regular Polytopes in Four and Higher Dimensions

This paper presents a tutorial review of the construction of all regular polytopes in spaces of all possible dimensions . .It focusses on how to make instructive, 3-dimensional, physical visualization models for the polytopes of dimensions 4 through 6, using solid free-form fabrication technology.

متن کامل

Approximation properties of random polytopes associated with Poisson hyperplane processes

We consider a stationary Poisson hyperplane process with given directional distribution and intensity in d-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body K and consider the intersection of all closed halfspaces bounded by hyperplanes of the process and containing K. We study how well these random polytopes approximate K (measured by the Hausdorff...

متن کامل

On convex envelopes and underestimators for bivariate functions

In this paper we discuss convex underestimators for bivariate functions. We first present a method for deriving convex envelopes over the simplest two-dimensional polytopes, i.e., triangles. Next, we propose a technique to compute the value at some point of the convex envelope over a general two-dimensional polytope, together with a supporting hyperplane of the convex envelope at that point. No...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Visualization

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2016